Cut-free systems for three-valued modal logics.
نویسندگان
چکیده
منابع مشابه
Three-valued Logics in Modal Logic
Every truth-functional three-valued propositional logic can be conservatively translated into the modal logic S5. We prove this claim constructively in two steps. First, we define a Translation Manual that converts any propositional formula of any threevalued logic into a modal formula. Second, we show that for every S5-model there is an equivalent three-valued valuation and vice versa. In gene...
متن کاملModal Systems Based on Many-valued Logics
We propose a general semantic notion of modal many-valued logic. Then, we explore the difficulties to characterize this notation in a syntactic way and analyze the existing literature with respect to this framework.
متن کاملMany-valued modal logics
Two families of many-valued modal logics are investigated. Semantically, one family is characterized using Kripke models that allow formulas to take values in a finite many-valued logic, at each possible world. The second family generalizes this to allow the accessibility relation between worlds also to be many-valued. Gentzen sequent calculi are given for both versions, and soundness and compl...
متن کاملClassic-Like Cut-Based Tableau Systems for Finite-Valued Logics
A general procedure is presented for producing classic-like cut-based tableau systems for finite-valued logics. In such systems, cut is the only branching rule, and formulas are accompanied by signs acting as syntactic proxies for the two classical truth-values. The systems produced are guaranteed to be sound, complete and analytic, and they are also seen to polinomially simulate the truth-tabl...
متن کاملCut-free sequent and tableau systems for propositional Diodorean modal logics
We present sound, (weakly) complete and cut-free tableau systems for the propositional normal modal logics S4:3, S4:3:1 and S4:14. When the modality 2 is given a temporal interpretation, these logics respectively model time as a linear dense sequence of points; as a linear discrete sequence of points; and as a branching tree where each branch is a linear discrete sequence of points. Although cu...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Notre Dame Journal of Formal Logic
سال: 1992
ISSN: 0029-4527
DOI: 10.1305/ndjfl/1093634401